Semantics-based Logics over Hierarchical Nominative Data
نویسندگان
چکیده
In the paper new logics oriented on hierarchical data are developed. Algebras of partial predicates over such data with special compositions as operations form a semantic base for constructed logics. Characteristic property of such logics is the usage of composite names in their languages. Semantic properties of these logics are studied; corresponding sequent calculi are defined, their soundness and completeness are proved for logics of renominative level.
منابع مشابه
Programming logics - an introduction to verification and semantics
The best ebooks about Programming Logics An Introduction To Verification And Semantics that you can get for free here by download this Programming Logics An Introduction To Verification And Semantics and save to your desktop. This ebooks is under topic such as programs: semantics and verification springer p-logic: property verià ̄¥cation for haskell programs logic, semantics and verification ...
متن کاملProving Properties of Programs on Hierarchical Nominative Data
In the paper we develop methods for proving properties of programs on hierarchical nominative data on the basis of the composition-nominative approach. In accordance with this approach, the semantics of a program is a function on nominative data constructed from basic operations using compositions (operations on functions) which represent programming language constructs. Nominative data can be ...
متن کاملSatisfiability Problem in Composition-Nominative Logics of Quantifier-Equational Level
We investigate algorithms for solving the satisfiability problem in composition-nominative logics of quantifier-equational level. These logics are algebra-based logics of partial predicates constructed in a semantic-syntactic style on the methodological basis, which is common with programming; they can be considered as generalizations of traditional logics on classes of partial predicates that ...
متن کاملCanonicity and bi-approximation in non-classical logics
Non-classical logics, or variants of non-classical logics, have rapidly been developed together with the progress of computer science since the 20th century. Typically, we have found that many variants of non-classical logics are represented as ordered algebraic structures, more precisely as lattice expansions. From this point of view, we can think about the study of ordered algebraic structure...
متن کاملLogics of Quasiary Predicates in Formal Software Development
Logics of quasiary predicates are algebra-based logics constructed in a semantic-syntactic style on the methodological basis, which is common with programming. Such way of construction gives a possibility to use these logics in formal methods of software development. We demonstrate the main ideas of program logic construction and give formal definitions for an important fragment of program logi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2012